Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems

We study non-convex quadratic minimization problems under (possibly non-convex) quadratic and linear constraints, and characterize both Lagrangian and Semi-Lagrangian dual bounds in terms of conic optimization. While the Lagrangian dual is equivalent to the SDP relaxation (which has been known for quite a while, although the presented form, incorporating explicitly linear constraints, seems to be novel), we show that the Semi-Lagrangian dual is equivalent to a natural copositive relaxation (and this has apparently not been observed before). This way, we arrive at conic bounds tighter than the usual Lagrangian dual (and thus than the SDP) bounds. Any of the known tractable inner approximations of the copositive cone can be used for this tightening, but in particular, above mentioned characterization with explicit linear constraints is a natural, much cheaper, relaxation than the usual zero-order approximation by doubly nonnegative (DNN) matrices, and still improves upon the Lagrangian dual bounds. These approximations are based on LMIs on matrices of basically the original order plus additional linear constraints (in contrast to more familiar sum-of-squares or moment approximation hierarchies), and thus may have merits in particular for large instances where it is important to employ only a few inequality constraints (eg., n instead of n(n−1) 2 for the DNN relaxation). Further we specify sufficient conditions for tightness of the Semi-Lagrangian relaxation and show that copositivity of the slack matrix guarantees global optimality for KKT points of this problem, thus significantly improving upon a well-known second-order global optimality condition.